package codetop.microsoft.T162;

/**
 * @Author: 18362
 * @Create: 2022-09-11 21:21:20 星期日
 */
class Solution {
    public int findPeakElement(int[] nums) {
        int left = 0, right = nums.length-1;
        while (left < right) {
            int mid = (left + right) / 2;
            if (nums[mid] < nums[mid+1])
                left = mid + 1;
            else
                right = mid;
        }
        return left;
    }
}
